Directed Multicut is W[1]-hard, Even for Four Terminal Pairs
نویسندگان
چکیده
منابع مشابه
Directed multicut is W[1]-hard, even for four terminal pairs
We prove that Multicut in directed graphs, parameterized by the size of the cutset, is W [1]-hard and hence unlikely to be fixed-parameter tractable even if restricted to instances with only four terminal pairs. This negative result almost completely resolves one of the central open problems in the area of parameterized complexity of graph separation problems, posted originally by Marx and Razg...
متن کاملTetris is Hard, Even to Approximate
Figure 1: The tetrominoes Sq (“square”), LG (“left gun”), RG (“right gun”), LS (“left snake”), RS (“right snake”), I, and T, with each piece’s center marked. of the top row of the gameboard, and falls downward at a constant speed. As it falls, the player can rotate the piece and slide it horizontally. If, when the piece comes to rest, all gridsquares in an entire row h of the gameboard are fill...
متن کاملDirected Multicut with linearly ordered terminals
Motivated by an application in network security, we investigate the following “linear” case of Directed Multicut. Let G be a directed graph which includes some distinguished vertices t1, . . . , tk. What is the size of the smallest edge cut which eliminates all paths from ti to tj for all i < j? We show that this problem is fixed-parameter tractable when parametrized in the cutset size p via an...
متن کاملDistinct Elements is Hard Even for Random Data Streams
We continue the study of approximating the number of distinct elements in the data stream model to within a (1 ± ) factor with constant probability. It was shown by Indyk and Woodruff (FOCS, 2003) that if the stream may consist of arbitrary data arriving to the streaming algorithm in an arbitrary order, then any 1-pass algorithm requires Ω(1/ ) bits of space to perform this task. In an attempt ...
متن کاملUNO Is Hard, Even for a Single Player
This paper investigates the popular card game UNO R © from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, including both cooperative and uncooperative versions, and analyze their computational complexity. In particular, we prove that even a single-player version of UNO is NP-complete, although some restricted cases are in P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2018
ISSN: 1942-3454,1942-3462
DOI: 10.1145/3201775